Undecidability of Network Coding, Conditional Information Inequalities, and Conditional Independence Implication
نویسندگان
چکیده
We resolve three long-standing open problems, namely the (algorithmic) decidability of network coding, conditional information inequalities, and independence implication among random variables, by showing that these problems are undecidable. The proof utilizes a construction inspired Herrmann’s arguments on embedded multivalued database dependencies, studied Dougherty, Freiling Zeger, together with novel to represent group automorphisms top network.
منابع مشابه
Conditional independence, conditional mixing and conditional association
Some properties of conditionally independent random variables are studied. Conditional versions of generalized Borel-Cantelli lemma, generalized Kolmogorov’s inequality and generalized Hájek-Rényi inequality are proved. As applications, a conditional version of the strong law of large numbers for conditionally independent random variables and a conditional version of the Kolmogorov’s strong law...
متن کاملDo essentially conditional information inequalities
We show that two essentially conditional linear information inequalities (including the Zhang–Yeung’97 conditional inequality) do not hold for asymptotically entropic points. This result raises the question of the “physical” meaning of these inequalities and the validity of their use in practice-oriented applications.
متن کاملThe Implication of Probabilistic Conditional Independence and Embedded Multivalued Dependency
It has been suggested that Bayesian networks and relational databases are different because the implication problems for probabilistic conditional independence and embedded multivalued dependency do not always coincide. The present study indicates that the implication problems coincide on solvable classes of dependencies and differ on unsolvable classes. We therefore maintain that Bayesian netw...
متن کاملPropositional Independence Conditional independence
Independence – the study of what is relevant to a given problem of reasoning – is an important AI topic. In this paper, we investigate several notions of conditional independence in propositional logic: Darwiche and Pearl’s conditional independence, and two more restricted forms of it, called strong conditional independence and perfect conditional independence. Many characterizations and proper...
متن کاملConditional independence and natural conditional functions
The concept of conditional independence (CI) within the framework of natural conditional functions (NCFs) is studied. An NCF is a function ascribing natural numbers to possible states of the world; it is the central concept of Spohn's theory of deterministic epistemology. Basic properties of CI within this framework are recalled, and further results analogous to the results concerning probabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2023
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2023.3247570